Retrial Queuing System with Starting Failure, Single Vacation and Orbital Search
نویسندگان
چکیده
منابع مشابه
Retrial Queuing System with Single Working Vacation under Pre-Emptive Priority Service
Consider a single server retrial queueing system with preemptive priority service and single working vacation in which two types of customers arrive in a Poisson process with arrival rates λ1 for low and λ2 for high priority customers. We assume that regular service times follow an exponential distribution with parameters μ1 and μ2 correspondingly. The retrial is introduced for low priority cus...
متن کاملAn Inventory System with Retrial Demands and Multiple Server Vacation
Abstract: In this article, we consider a continuous review inventory system with Markovian demand. The operating policy is ( , ) s S policy, that is, the maximum inventory level is and whenever the inventory level drops to S , s an order for units is placed. The ordered items are received after a random time which is assumed to be exponential distribution. The server goes for a vacation of an e...
متن کاملAn M/G/1 Retrial Queue with Single Working Vacation
We consider an M/G/1 retrial queue with general retrial times and single working vacation. During the working vacation period, customers can be served at a lower rate. Both service times in a vacation period and in a service period are generally distributed random variables. Using supplementary variable method we obtain the probability generating function for the number of customers and the ave...
متن کاملRetrial Queueing System with Single Working Vacation Under Pre-Emptive Priority Service
Consider a single server retrial queueing system with pre-emptive priority service and single working vacation in which two types of customers arrive in a Poisson process with arrival rates ?1 for low and ?2 for high priority customers. We assume that regular service times follow an exponential distribution with parameters μ1 and μ2 correspondingly. The retrial is introduced for low priority cu...
متن کاملA simulation algorithm for a single server retrial queuing system with batch arrivals
Many systems of real word are modeled by retrial queuing system with batch arrivals. Analytical formulas for this class of systems are complicated and address only particular cases. The paper presents a study approach for this kind of systems, based on discrete event simulation. It is shown that the given algorithm has a polynomial complexity. Also, the object-oriented design we used for implem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/5042-7367